Iterative Heuristics for Permutation Flow Shops with Total Flowtime Minimization
نویسندگان
چکیده
In this paper, flow shop scheduling problems with total flowtime minimization is considered. IRZ (iterative RZ, presented by Rajendran and Ziegler, EJOR, 1997) is found to be effective to improve solutions and LR (developed by Liu & Reeves, EJOR, 2001) is suitable for initial solution developing. By integrating FPE (forward pair wise exchange) and FPE-R(forward pair wise exchangerestart) with IRZ, two efficient composite heuristics, ECH1 and ECH2, are proposed. Computational results show that the proposed three outperform three best existing ones in performance and ECH1 is best. IRZ is the fastest heuristic. ECH2 is a trade-off between IRZ and ECH1 both in effectiveness and efficiency.
منابع مشابه
Relax and Fix Heuristics for Simultaneous Lot Sizing and Sequencing the Permutation Flow Shops with Sequence-Dependent Setups
This paper proposes two relax and fix heuristics for the simultaneous lot sizing and sequencing problem in permutation flow shops involving sequence-dependent setups and capacity constraints. To evaluate the effectiveness of mentioned heuristics, two lower bounds are developed and compared against the optimal solution. The results of heuristics are compared with the selected lower bound .
متن کاملA comprehensive review and evaluation of permutation flowshop heuristics to minimize flowtime
In recent years, a large number of heuristics have been proposed for the minimization of the total or mean flowtime/completion time of the well-known permutation flowshop scheduling problem. Although some literature reviews and comparisons have been made, they do not include the latest available heuristics and results are hard to compare as no common benchmarks and computing platforms have been...
متن کاملEfficient Heuristics for Flowshop Scheduling for Minimizing the Makespan and Total Flowtime of Jobs
The problem of scheduling in permutation flowshops has been extensively investigated by many researchers. Recently, attempts are being made to consider more than one objective simultaneously and develop algorithms to obtain a set of Pareto-optimal solutions. Varadharajan et al. (2005) presented a multi-objective simulated-annealing algorithm (MOSA) for the problem of permutation-flowshop schedu...
متن کاملIterated Local Search Heuristics for Minimizing Total Completion Time in Permutation and Non-permutation Flow Shops
We study the improvement of non-permutation over permutation schedules in flow shops when minimizing the total completion time. We solve both problems by a two-phase heuristic. The first phase uses an iterated local search to find a good permutation schedule. The second phase explores non-permutation schedules using an effective insertion neighborhood, that permits to anticipate or delay a job ...
متن کاملEvolutionary Clustering Search for Flowtime Minimization in Permutation Flow Shop
This paper deals with the Permutation Flow Shop scheduling problem with the objective of minimizing total flow time, and therefore reducing in-process inventory. A new hybrid metaheuristic Genetic Algorithm Cluster Search is proposed for the scheduling problem solution. The performance of the proposed method is evaluated and results are compared with the best reported in the literature. Experim...
متن کامل